Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
نویسندگان
چکیده
منابع مشابه
Towards a Characterisation of the Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms have been successfully applied to hard combinatorial problems from different domains. Due to their inherent randomness, the run-time behaviour of these algorithms is characterised by a random variable. The detailed knowledge of the run-time distribution provides important information about the behaviour of SLS algorithms. In this paper we investigate the...
متن کاملOn the Run-time Behaviour of Stochastic Local Search Algorithms for SAT
Stochastic local search (SLS) algorithms for the propositional satisfiability problem (SAT) have been successfully applied to solve suitably encoded search problems from various domains. One drawback of these algorithms is that they are usually incomplete. We refine the notion of incompleteness for stochastic decision algorithms by introducing the notion of “probabilistic asymptotic completenes...
متن کاملSearch Space Features Underlying the Performance of Stochastic Local Search Algorithms for MAX-SAT
MAX-SAT is a well-known optimisation problem that can be seen as a generalisation of the propositional satisfiability problem. In this study, we investigate how the performance of stochastic local search (SLS) algorithms — a large and prominent class of algorithms that includes, for example, Tabu Search, Evolutionary Algorithms and Simulated Annealing — depends on features of the underlying sea...
متن کاملMultilevel Stochastic Local Search for SAT
Satisfiability (SAT) problems are a hot topic in the field of combinatorial optimization, having strong theoretical foundations as well as many practical applications. Moreover, approximate SAT algorithms have gained widespread attention because they offer a computationally feasible approach to finding high-quality solutions to NP-hard problems in a scalable and efficient manner. Complete SAT a...
متن کاملinvestigating the feasibility of a proposed model for geometric design of deployable arch structures
deployable scissor type structures are composed of the so-called scissor-like elements (sles), which are connected to each other at an intermediate point through a pivotal connection and allow them to be folded into a compact bundle for storage or transport. several sles are connected to each other in order to form units with regular polygonal plan views. the sides and radii of the polygons are...
ذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Artificial Intelligence
سال: 1999
ISSN: 0004-3702
DOI: 10.1016/s0004-3702(99)00048-x